Perfect Gaussian Integer Sequences From Binary Idempotents
نویسندگان
چکیده
Gaussian integers are the complex numbers whose real and imaginary parts are both integers. Recently, Gaussian integer sequences with ideal autocorrelation, called the perfect Gaussian integer sequences, have been extensively used in codedivision multiple-access and orthogonal frequencydivision multiplexing (OFDM) systems. In this paper, binary idempotent is utilized to generate a set of integers and can be employed as the positions for a given Gaussian integer. The obtained perfect sequences are over two Gaussian integers and have high sequence energy. As the sequence length is large, their energy efficiency is close to 1 such that these sequences can be used to peak-to-average power ratio reduction in OFDM systems.
منابع مشابه
Research on perfect binary correlation sequences based on higher-order cumulant
Current researches define the perfect signal by the inner product of sequence itself and its delay sequence. However, these traditional sequences based on second-order statistics cannot handle colored Gaussian measurement noise automatically. Because higher-order cumulant (HOC) is insensitive to the adding Gaussian noise and symmetrical non-Gaussian noise, a new kind of perfect binary signal wi...
متن کاملDistinct 8-QAM+ Perfect Arrays
This paper investigates the construction of 8-QAM+ perfect arrays with at least an odd integer in their sizes, and gives the sufficient condition producing distinct 8-QAM+ perfect arrays. For different choices of odd integers in a given size of at least an odd integer, the resultant distinct 8-QAM+perfect arrays have their own sizes. For each choice, the number of the resultant distinct 8-QAM+p...
متن کاملSmarandache Idempotents in Loop Rings
In this paper we establish the existance of S-idempotents in case of loop rings ZtLn(m) for a special class of loops Ln(m); over the ring of modulo integers Zt for a specific value of t.These loops satisfy the conditions g 2 i = 1 for every gi ∈ Ln(m). We prove ZtLn(m) has an S-idempotent when t is a perfect number or when t is of the form 2p or 3p (where p is an odd prime) or in general when t...
متن کاملOn Perfect Binary Quadratic Forms
A quadratic form f is said to be perfect if its values at points of the integer lattice form a semigroup under multiplication. A problem of V. Arnold is to describe all perfect binary integer quadratic forms. If there is an integer bilinear map s such that f(s(x, y)) = f(x)f(y) for all vectors x and y from the integer 2-dimensional lattice, then the form f is perfect. We give an explicit descri...
متن کاملSpreading Sequences Generated Using Asymmetrical Integer-Number Maps
Chaotic sequences produced by piecewise linear maps can be transformed to binary sequences. The binary sequences are optimal for the asynchronous DS/CDMA systems in case of certain shapes of the maps. This paper is devoted to the one-to-one integer-number maps derived from the suitable asymmetrical piecewise linear maps. Such maps give periodic integer-number sequences, which can be transformed...
متن کامل